Ranking efficient units by regular polygon area in DEA

ranking efficient units by regular polygon area in dea

Ranking Efficient Units in DEA by Using TOPSIS Method

There exist many different ranking methods for ranking efficient Decision Making Units (DMUs) in Data Envelopment Analysis (DEA). However, since each of these methods considers a certain theory for ranking, they may give different ranks. In practice, choosing a ranking method, the results of which the Decision Maker (DM) would be able to trust is an important issue. In this paper, we consider s...

Ranking units in DEA by using the voting system

Ranking DEA Efficient Units with the Most Compromising Common Weights

One may employ Data Envelopment Analysis (DEA) to discriminate decision-making units (DMUs) into efficient and inefficient ones base upon the multiple inputs and output performance indices. In this paper we consider that there is a centralized decision maker (DM) who ‘owns’ or ‘supervises’ all the DMUs. In such intraorganizational scenario the DM has an interest in discriminating the efficient ...

Ranking units with fuzzy data in DEA

In this study, both optimistic and pessimistic approaches of data envelopment analysis are applied to propose an equitable ranking method in fuzzy environments. To this end, we suppose that the sum of efficiency scores of all decision making units (DMUs) equals to unity. Using the worst-best and best-worst approaches, the minimum and maximum possible efficiency scores of each DMU are estimated ...

Efficient Regular Polygon Dissections

We study the minimum number g(m,n) (respectively, p(m, n)) of pieces needed to dissect a regular m-gon into a regular n-gon of the same area using glass-cuts (respectively, polygonal cuts). First we study regular polygon-square dissections and show that dn/2e − 2 ≤ g(4, n) ≤ n 2 + o(n) and dn/4e ≤ g(n, 4) ≤ n 2 + o(n) hold for sufficiently large n. We also consider polygonal cuts, i.e., the min...